Sets of Grammars between Context-Free and Context-Sensitive
نویسنده
چکیده
We discuss some sets of g r a m m a r s whose generat ive power l ies between that of the set of contextf ree g r a m m a r s and that of the set of contextsensit ive g r a m m a r s . These sets a re developed by subjecting genera to rs of context-sensi t ive g r a m m a r s to abs t rac t vers ions of a "hardware" res t r i c t ion to which the u s e r s of natural languages, unlike the d e s c r i b e r s of natural languages, might be subject.
منابع مشابه
Rough Sets and Learning by Unification
We apply basic notions of the theory of rough sets, due to Pawlak [30, 31], to explicate certain properties of unification-based learning algorithms for categorial grammars, introduced in [6, 11] and further developed in e.g. [18, 19, 24, 25, 26, 9, 28, 14, 15, 3]. The outcomes of these algorithms can be used to compute both the lower and the upper approximation of the searched language with re...
متن کاملTable-driven and context-sensitive collage languages
In this paper, we introduce the notions of context-sensitive and TOL collage grammars as generalizations of context-free collage grammars. Both kinds of picture generating devices are more powerful than the context-free case. Nevertheless, the sizes of collages in a TOL collage language can be shown to grow at most exponentially. In contrast to this, there are no such bounds for context-sensiti...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملA Note on the Cooperation in Rewriting Systems with Context-Dependency Checking
Extended Abstract Rewriting systems based on simple forms of productions play an important role in formal language theory. Therefore, it is no surprise that context-free grammars and their modifications are one of the most studied models. However, many of the systems describing practically interesting applications, such as the parsers of natural and programming languages, require additional mec...
متن کاملFinding Grammars That Are More Than Context-Free, But Not Fully Context-Sensitive
This survey paper describes several extensions of context-free grammars as defined in the Chomsky hierarchy. These augmentations use a variety of different strategies to create grammars that generate all context-free and some context-sensitive languages. The basic concepts of each of these extensions will be examined, as well as whether the enhanced grammars inherited some of the desirable prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1965